A Gauss Markov approach to conditioning to block data

نویسنده

  • SUNDERRAJAN KRISHNAN
چکیده

Integration of data defined at different scales is a recurring problem in Earth Science applications. Integrating seismic data with well data defined on a much smaller scale is one such application. Currently sequential and iterative simulation algorithms are not equipped to combine data which are non-linearly related with each other over different scales. This paper proposes a novel technique based on the theory of Gauss-Markov random functions (GMrf). The conditioning of point simulations to point data and nonlinear block data is performed by using a Metropolis-Hastings sampler on a Markovtype random field. The efficiency of the algorithm is demonstrated with an example based on an exhaustive synthetic data set. Simulations honor a strongly anisotropic covariance, a bimodal histogram and are conditioned to point data and imprecise block data. A second example of conditioning to weighted harmonic averages along irregularly shaped blocks is discussed. The general applicability of the algorithm to problems of greater complexity is discussed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Uncertainty Quanti cation in the Ensemble Kalman Filter

The ensemble Kalman lter (EnKF) provides an approximate, sequential Monte Carlo solution to the recursive data assimilation algorithm for hidden Markov chains. The challenging conditioning step is approximated by a linear updating, and the updating weights, termed Kalman weights, are inferred from the ensemble members. The EnKF scheme is known to provide unstable predictions and to underestimat...

متن کامل

Fractal Coding Performance for First Order Gauss-Markov Models

Fixed block size fractal coding is evaluated for first-order Gauss-Markov models, and the effects of varying the correlation are presented. Performance for this class of statistical models is found to be poor compared with traditional techniques such as transform coding.

متن کامل

Necessary and Sufficient Conditions for Global Geometric Convergence of Block Gauss-seidel Iteration Algorithm Applied to Markov Chains

Convergence properties of the block Gauss-Seidel algorithm applied to ergodic Markov chains are discussed in this paper. This algorithm is one of the most prevalent methods for computing ergodic probability vectors of large-scale Markov chains. We will provide necessary and sufficient conditions for global geometric convergence of this algorithm. To apply this algorithm, the state space of a Ma...

متن کامل

Regularization and the General Gauss-markov Linear Model

If the coefficient matrix in the general Gauss-Markov linear model is ill-conditioned, then the solution is very sensitive to perturbations. For such problems, we propose to add Tikhonov regularization to the model, and we show that this actually stabilizes the solution and decreases its variance. We also give a numerically stable algorithm for computing the regularized solution efficiently.

متن کامل

Fractal Coding Performance for First Order Gauss

Fixed block size fractal coding is evaluated for rst-order Gauss-Markov models, and the eeects of varying the correlation are presented. Performance for this class of statistical models is found to be poor compared with traditional techniques such as transform coding.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001